Bidiagonalization and symmetric tridiagonalization by systolic arrays
نویسندگان
چکیده
منابع مشابه
Bidiagonalization and symmetric tridiagonalization by systolic arrays
We give a systolic algorithm and array for bidiagonalization of an n x n matrix in O(nlog, n) time, using O(n2) cells. Bandedness of the input matrix may be effectively exploited. If the matrix is banded, with p nonzero subdiagonals and q nonzero superdiagonais, then 4n In(p + q) + O(n) clocks and 2n(p + q ) + O((p + q)’ + n) cells are needed. This is faster than the best previously reported re...
متن کاملBlock Lanczos Tridiagonalization of Complex Symmetric Matrices
The classic Lanczos method is an effective method for tridiagonalizing real symmetric matrices. Its block algorithm can significantly improve performance by exploiting memory hierarchies. In this paper, we present a block Lanczos method for tridiagonalizing complex symmetric matrices. Also, we propose a novel componentwise technique for detecting the loss of orthogonality to stablize the block ...
متن کاملParallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for the block-tridiagonal divide-and-conquer algorithm for computing eigensystems and is useful for many algorithms desiring the efficiencies of block structure in matrices. For an “effectively” sparse matrix, which freq...
متن کاملTridiagonalization of a dense symmetric matrix on multiple GPUs and its application to symmetric eigenvalue problems
For software to fully exploit the computing power of emerging heterogeneous computers, not only must the required computational kernels be optimized for the specific hardware architectures but also an effective scheduling scheme is needed to utilize the available heterogeneous computational units and to hide the communication between them. As a case study, we develop a static scheduling scheme ...
متن کاملSystolic Arrays and Stack Decoding
An active area of current research on deep space communications is the development of codes usable at low signal-tonoise ratio. The requirements for such codes are low error probability and the practicality of the decoding algorithm. It is well known that the error probability of convolutional codes decreases with their constraint lengths. However, the complexity of the Viterbi algorithm, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of VLSI signal processing systems for signal, image and video technology
سال: 1990
ISSN: 0922-5773
DOI: 10.1007/bf00929922